The finiteness of synchronous, tabled picture languages is decidable

نویسنده

Bianca Truthe

چکیده

In the present paper, synchronous, tabled chain code picture systems based on Lindenmayer systems (sT0L system) are studied with respect to the finiteness of their picture languages. The finiteness is proved to be decidable. Additionally, a method is given for deciding whether or not an sT0L system generates a finite picture language. © 2006 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Method for Deciding the Finiteness of Synchronous, Tabled Picture Languages

In the present paper, synchronous, tabled chain code picture systems based on Lindenmayer systems (sT0L systems) are studied with respect to the finiteness of their picture languages. The finiteness is proved to be decidable. Additionally, a method is given for deciding whether an sT0L system generates a finite picture language or not.

متن کامل

On the Finiteness of Picture Languages of Synchronous Deterministic Chain Code Picture Systems

Chain Code Picture Systems are Lindenmayer systems over a special alphabet. The strings generated are interpreted as pictures. This leads to Chain Code Picture Languages. In this paper, synchronous deterministic Chain Code Picture Systems (sD0L systems) are studied with respect to the finiteness of their picture languages. First, a hierarchy of abstractions is developed, in which the interpreta...

متن کامل

Single-Rooted DAGs in Regular DAG Languages: Parikh Image and Path Languages

In a recent survey (Drewes, 2017) of results on DAG automata some open problems are formulated for the case where the DAG language accepted by a DAG automaton A is restricted to DAGs with a single root, denoted by L(A)u. Here we consider each of those problems, demonstrating that: (i) the finiteness of L(A)u is decidable, (ii) the path languages of L(A)u can be characterized in terms of the str...

متن کامل

On the Finiteness Property for Rational Matrices

We analyze the periodicity of optimal long products of matrices. A set of matrices is said to have the finiteness property if the maximal rate of growth of long products of matrices taken from the set can be obtained by a periodic product. It was conjectured a decade ago that all finite sets of real matrices have the finiteness property. This conjecture, known as the “finiteness conjecture”, is...

متن کامل